Empowering Mini-Bucket in Anytime Heuristic Search with Look-Ahead: Preliminary Evaluation
نویسندگان
چکیده
The paper explores the potential of look-ahead methods within the context of AND/OR search in graphical models using the Mini-Bucket heuristic for combinatorial optimization tasks (e.g., weighted CSPS or MAP inference). We study how these methods can be used to compensate for the approximation error of the initially generated Mini-Bucket heuristics, within the context of anytime Branch-And-Bound search.
منابع مشابه
Residual-Guided Look-Ahead in AND/OR Search for Graphical Models
We introduce the concept of local bucket error for the mini-bucket heuristics and show how it can be used to improve the power of AND/OR search for combinatorial optimization tasks in graphical models (e.g. MAP/MPE or weighted CSPs). The local bucket error illuminates how the heuristic errors are distributed in the search space, guided by the minibucket heuristic. We present and analyze methods...
متن کاملLook-Ahead with Mini-Bucket Heuristics for MPE
The paper investigates the potential of look-ahead in the context of AND/OR search in graphical models using the MiniBucket heuristic for combinatorial optimization tasks (e.g., MAP/MPE or weighted CSPs). We present and analyze the complexity of computing the residual (a.k.a. Bellman update) of the Mini-Bucket heuristic and show how this can be used to identify which parts of the search space a...
متن کاملNew Look-Ahead Schemes for Constraint Satisfaction
This paper presents new look-ahead schemes for backtracking search when solving constraint satisfaction problems. The look-ahead schemes compute a heuristic for value ordering and domain pruning, which influences variable orderings at each node in the search space. As a basis for a heuristic, we investigate two tasks, both harder than the CSP task. The first is finding the solution with min-num...
متن کاملA Mini-bucket-based Scheme for Approximating Combinatorial Optimization Tasks: Preliminary Results
The paper addresses the problem of computing lower bounds on the optimal costs associated with each unary assignment of a value to a variable in combinatorial optimization problems. This problem is instrumental in a variety of domains, in particular in proba-bilistic reasoning. Our aim is to use such lower bounds as a look-ahead procedure guiding search algorithms for optimal solutions. In part...
متن کاملOn the Impact of Subproblem Orderings on Anytime AND/OR Best-First Search for Lower Bounds
Best-first search can be regarded as an anytime scheme for producing lower bounds on the optimal solution, a characteristic that is mostly overlooked. In this paper we explore this topic in the context of AND/OR best-first search, guided by the mini-bucket heuristic, when solving graphical models. In that context, the impact of the secondary heuristic for subproblem ordering becomes apparent, e...
متن کامل